Glassy Critical Points and Random Field Ising Model

We consider the critical properties of points of continuous glass transition as one can find in liquids in presence of constraints or in liquids in porous media. Through a one loop analysis we show that the critical Replica Field Theory describing these points can be mapped in the $\phi^4$-Random Field Ising Model. We confirm our analysis studying the finite size scaling of the $p$-spin model defined on sparse random graph, where a fraction of variables is frozen such that the phase transition is of a continuous kind.Comment: The paper has been completely revised. A completely new part with simulations of a p-spin glass model on random graph has been included. An appendix with the Mathematica worksheet used in the calculation of the diagrams has also been adde

Characterizing and Improving Generalized Belief Propagation Algorithms on the 2D Edwards-Anderson Model

We study the performance of different message passing algorithms in the two dimensional Edwards Anderson model. We show that the standard Belief Propagation (BP) algorithm converges only at high temperature to a paramagnetic solution. Then, we test a Generalized Belief Propagation (GBP) algorithm, derived from a Cluster Variational Method (CVM) at the plaquette level. We compare its performance with BP and with other algorithms derived under the same approximation: Double Loop (DL) and a two-ways message passing algorithm (HAK). The plaquette-CVM approximation improves BP in at least three ways: the quality of the paramagnetic solution at high temperatures, a better estimate (lower) for the critical temperature, and the fact that the GBP message passing algorithm converges also to non paramagnetic solutions. The lack of convergence of the standard GBP message passing algorithm at low temperatures seems to be related to the implementation details and not to the appearance of long range order. In fact, we prove that a gauge invariance of the constrained CVM free energy can be exploited to derive a new message passing algorithm which converges at even lower temperatures. In all its region of convergence this new algorithm is faster than HAK and DL by some orders of magnitude.Comment: 19 pages, 13 figure

Clusters of solutions and replica symmetry breaking in random k-satisfiability

We study the set of solutions of random k-satisfiability formulae through the cavity method. It is known that, for an interval of the clause-to-variables ratio, this decomposes into an exponential number of pure states (clusters). We refine substantially this picture by: (i) determining the precise location of the clustering transition; (ii) uncovering a second `condensation' phase transition in the structure of the solution set for k larger or equal than 4. These results both follow from computing the large deviation rate of the internal entropy of pure states. From a technical point of view our main contributions are a simplified version of the cavity formalism for special values of the Parisi replica symmetry breaking parameter m (in particular for m=1 via a correspondence with the tree reconstruction problem) and new large-k expansions.Comment: 30 pages, 14 figures, typos corrected, discussion of appendix C expanded with a new figur

Instability of one-step replica-symmetry-broken phase in satisfiability problems

We reconsider the one-step replica-symmetry-breaking (1RSB) solutions of two random combinatorial problems: k-XORSAT and k-SAT. We present a general method for establishing the stability of these solutions with respect to further steps of replica-symmetry breaking. Our approach extends the ideas of [A.Montanari and F. Ricci-Tersenghi, Eur.Phys.J. B 33, 339 (2003)] to more general combinatorial problems. It turns out that 1RSB is always unstable at sufficiently small clauses density alpha or high energy. In particular, the recent 1RSB solution to 3-SAT is unstable at zero energy for alpha< alpha_m, with alpha_m\approx 4.153. On the other hand, the SAT-UNSAT phase transition seems to be correctly described within 1RSB.Comment: 26 pages, 7 eps figure

On the cavity method for decimated random constraint satisfaction problems and the analysis of belief propagation guided decimation algorithms

We introduce a version of the cavity method for diluted mean-field spin models that allows the computation of thermodynamic quantities similar to the Franz-Parisi quenched potential in sparse random graph models. This method is developed in the particular case of partially decimated random constraint satisfaction problems. This allows to develop a theoretical understanding of a class of algorithms for solving constraint satisfaction problems, in which elementary degrees of freedom are sequentially assigned according to the results of a message passing procedure (belief-propagation). We confront this theoretical analysis to the results of extensive numerical simulations.Comment: 32 pages, 24 figure

Approximation schemes for the dynamics of diluted spin models: the Ising ferromagnet on a Bethe lattice

We discuss analytical approximation schemes for the dynamics of diluted spin models. The original dynamics of the complete set of degrees of freedom is replaced by a hierarchy of equations including an increasing number of global observables, which can be closed approximately at different levels of the hierarchy. We illustrate this method on the simple example of the Ising ferromagnet on a Bethe lattice, investigating the first three possible closures, which are all exact in the long time limit, and which yield more and more accurate predictions for the finite-time behavior. We also investigate the critical region around the phase transition, and the behavior of two-time correlation functions. We finally underline the close relationship between this approach and the dynamical replica theory under the assumption of replica symmetry.Comment: 21 pages, 5 figure

Aging dynamics of heterogeneous spin models

We investigate numerically the dynamics of three different spin models in the aging regime. Each of these models is meant to be representative of a distinct class of aging behavior: coarsening systems, discontinuous spin glasses, and continuous spin glasses. In order to study dynamic heterogeneities induced by quenched disorder, we consider single-spin observables for a given disorder realization. In some simple cases we are able to provide analytical predictions for single-spin response and correlation functions. The results strongly depend upon the model considered. It turns out that, by comparing the slow evolution of a few different degrees of freedom, one can distinguish between different dynamic classes. As a conclusion we present the general properties which can be induced from our results, and discuss their relation with thermometric arguments.Comment: 39 pages, 36 figure

On the dynamics of the glass transition on Bethe lattices

The Glauber dynamics of disordered spin models with multi-spin interactions on sparse random graphs (Bethe lattices) is investigated. Such models undergo a dynamical glass transition upon decreasing the temperature or increasing the degree of constrainedness. Our analysis is based upon a detailed study of large scale rearrangements which control the slow dynamics of the system close to the dynamical transition. Particular attention is devoted to the neighborhood of a zero temperature tricritical point. Both the approach and several key results are conjectured to be valid in a considerably more general context.Comment: 56 pages, 38 eps figure

Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms

Stochastic local search algorithms are frequently used to numerically solve hard combinatorial optimization or decision problems. We give numerical and approximate analytical descriptions of the dynamics of such algorithms applied to random satisfiability problems. We find two different dynamical regimes, depending on the number of constraints per variable: For low constraintness, the problems are solved efficiently, i.e. in linear time. For higher constraintness, the solution times become exponential. We observe that the dynamical behavior is characterized by a fast equilibration and fluctuations around this equilibrium. If the algorithm runs long enough, an exponentially rare fluctuation towards a solution appears.Comment: 21 pages, 18 figures, revised version, to app. in PRE (2003

Spatially heterogeneous ages in glassy dynamics

We construct a framework for the study of fluctuations in the nonequilibrium relaxation of glassy systems with and without quenched disorder. We study two types of two-time local correlators with the aim of characterizing the heterogeneous evolution: in one case we average the local correlators over histories of the thermal noise, in the other case we simply coarse-grain the local correlators. We explain why the former describe the fingerprint of quenched disorder when it exists, while the latter are linked to noise-induced mesoscopic fluctuations. We predict constraints on the pdfs of the fluctuations of the coarse-grained quantities. We show that locally defined correlations and responses are connected by a generalized local out-of-equilibrium fluctuation-dissipation relation. We argue that large-size heterogeneities in the age of the system survive in the long-time limit. The invariance of the theory under reparametrizations of time underlies these results. We relate the pdfs of local coarse-grained quantities and the theory of dynamic random manifolds. We define a two-time dependent correlation length from the spatial decay of the fluctuations in the two-time local functions. We present numerical tests performed on disordered spin models in finite and infinite dimensions. Finally, we explain how these ideas can be applied to the analysis of the dynamics of other glassy systems that can be either spin models without disorder or atomic and molecular glassy systems.Comment: 47 pages, 60 Fig